| Robert Endre Tarjan | |
|---|---|
| Born | April 30, 1948 Pomona, California |
| Fields | Computer Science |
| Institutions | Cornell Berkeley Stanford University New York University Princeton University Hewlett-Packard |
| Alma mater | Caltech, Stanford |
| Known for | Algorithms and data structures |
| Notable awards | Turing Award Nevanlinna Prize |
Robert Endre Tarjan (born April 30, 1948) is a renowned American computer scientist. He is the discoverer of several important graph algorithms, including Tarjan's off-line least common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and is also a Senior Fellow at Hewlett-Packard.[1]
Contents |
He was born in Pomona, California. His father was a child psychiatrist specializing in mental retardation, and ran a state hospital.[2] As a child, Tarjan read a lot of science fiction, and wanted to be an astronomer. He became interested in mathematics after reading Martin Gardner's mathematical games column in Scientific American. He became seriously interested in math in the eighth grade, thanks to a "very stimulating" teacher.[3]
While he was in high school, Tarjan got a job, where he worked IBM card punch collators. He first worked with real computers while studying astronomy at the Summer Science Program in 1964.[2]
Tarjan obtained a Bachelor's degree in mathematics from the California Institute of Technology in 1969. At Stanford University, he received his Master's degree in computer science in 1971 and a Ph.D. in computer science (with a minor in mathematics) in 1972. At Stanford, he was supervised by Robert Floyd[4] and Donald Knuth[5], both highly prominent computer scientists, and his Ph.D. dissertation was An Efficient Planarity Algorithm. Tarjan selected computer science as his area of interest because he believed that CS was a way of doing mathematics that could have a practical impact.[6]
Tarjan has been teaching at Princeton University since 1985.[6] He has also held academic positions at Cornell University (1972-73), University of California, Berkeley (1973-1975), Stanford University (1974-1980), and New York University (1981-1985). He has also been a fellow of the NEC Research Institute (1989-1997), a Visiting Scientist at the Massachusetts Institute of Technology (1996).
Tarjan has vast industrial experience: he has worked at AT&T Bell Labs (1980-1989), InterTrust Technologies (1997-2001), Compaq (2002) and Hewlett Packard (2006-present). He has served on several ACM and IEEE committees, and has also been editor of several referreed journals.
Tarjan has designed many efficient algorithms and data structures for solving problems in a wide variety of application areas. He has published more than 228 refereed journal articles and book chapters.
Tarjan is known for his pioneering work on graph theory algorithms and data structures. Some of his well-known algorithms include the Tarjan's off-line least common ancestors algorithm, and the Tarjan's strongly connected components algorithm. The Hopcroft-Tarjan planarity testing algorithm was the first linear-time algorithm for planarity-testing.[7]
Tarjan has also developed important data structures such as the Fibonacci heap (a heap data structure consisting of a forest of trees), and the splay tree (a self-adjusting binary search tree; co-invented by Tarjan and Daniel Sleator). Another significant contribution was the analysis of the disjoint-set data structure; he was the first to prove the optimal runtime involving the inverse Ackermann function.
Tarjan received the Turing Award jointly with John Hopcroft in 1986. The citation for the award states that it was:
For fundamental achievements in the design and analysis of algorithms and data structures.
Tarjan was also elected an ACM Fellow in 1994. The citation for this award states:[8]
For seminal advances in the design and analysis of data structures and algorithms.
Some of the other awards for Tarjan include:
|
|||||
|
|||||